Morphic Primitivity and Alphabet Reductions
نویسندگان
چکیده
An alphabet reduction is a 1-uniform morphism that maps a word to an image that contains a smaller number of different letters. In the present paper we investigate the effect of alphabet reductions on morphically primitive words, i. e., words that are not a fixed point of a nontrivial morphism. Our first main result answers a question on the existence of unambiguous alphabet reductions for such words, and our second main result establishes whether alphabet reductions can be given that preserve morphic primitivity. In addition to this, we study Billaud’s Conjecture – which features a different type of alphabet reduction, but is otherwise closely related to the main subject of our paper – and prove its correctness for a special case.
منابع مشابه
Loughborough University Institutional Repository
In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...
متن کاملMorphically Primitive Words (extended Abstract) *
In the present paper, we introduce an alternative notion of the primitivity of words, that – unlike the standard understanding of this term – is not based on the power (and, hence, the concatenation) of words, but on morphisms. For any alphabet Σ, we call a word w ∈ Σ∗ morphically imprimitive provided that there are a shorter word v and morphisms h, h′ : Σ∗ → Σ∗ satisfying h(v) = w and h′(w) = ...
متن کاملMaximal Blocks in Morphic and Automatic Words
Let w be a morphic word over a finite alphabet Σ, and let ∆ be a subalphabet. We study the behavior of maximal blocks of ∆ letters in w, and prove the following: let (ik, jk) denote the starting and ending positions, respectively, of the k’th maximal ∆-block in w. Then lim supk→∞(jk/ik) is algebraic if w is morphic, and rational if w is automatic. As a results, we show that the same holds if (i...
متن کاملStudy on Finite Words in Semigraph Folding
Rudolf Freund studied the splicing systems on graphs and strings. In this paper, with the definition of semigraph folding for the spliced DNA molecule, we characterized the morphic and antimorphic evolution for the alphabet for the folding of spliced semigraph. Also we obtain the set of all properly δlimit words is a totally ordered set with < δ for an antimorphic evolution.
متن کاملOn the Unavoidability of k-Abelian Squares in Pure Morphic Words
We consider a recently defined notion of k-abelian equivalence of words by concentrating on avoidability problems. The equivalence class of a word depends on the number of occurrences of different factors of length k for a fixed natural number k and the prefix of the word. We show that over a ternary alphabet, k-abelian squares cannot be avoided in pure morphic words for any natural number k. N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012